Hierarchical Scheduling in High Level Synthesis Using Resource Sharing Across Nested Loops

نویسندگان

  • Abhijit Ghosh
  • Sandeep K. Lodha
  • Ranga Vemuri
چکیده

This paper presents a resource-constrained scheduling algorithm for hierarchical behavioral speciications containing nested loops. The algorithm attempts to share resources across levels, to schedule operations that belong to diierent levels of the nested loop structures in the speciications as well as operations that belong to the same level. We compare the results of scheduling using our algorithm with those obtained using traditional list scheduling with no sharing of resources among diierent levels of the speciication. These results show an average improvement of 23.47% in terms of number of control steps.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Hierarchical Conditional Dependency Graphs for Conditional Resource Sharing

Conditional resource sharing has been identified as a possibility for optimizing high-level synthesis results. In this paper we propose a Hierarchical Conditional Dependency Graph representation that permits to treat conditional resource sharing in a generic fashion depending on the specific context, i.e. functional units, storage elements and interconnects. Resource usage conditions are repres...

متن کامل

Resource Constrained Modulo Scheduling with Global Resource Sharing

Commonly used scheduling algorithms in high-level synthesis are not capable of sharing resources across process boundaries. This results in the usage of at least one resource per operation type and process. A new method is proposed in order to overcome these restrictions and to share high-cost or limited resources within a process group. This allows the use of less than one resource per operati...

متن کامل

Scheduling of Iterative Algorithms with Matrix Operations for Efficient FPGA Design - Implementation of Finite Interval Constant Modulus Algorithm

This paper deals with the optimization of iterative algorithms with matrix operations or nested loops for hardware implementation in Field Programmable Gate Arrays (FPGA), using Integer Linear Programming (ILP). The method is demonstrated on an implementation of the Finite Interval Constant Modulus Algorithm. It is an equalization algorithm, suitable for modern communication systems (4G and beh...

متن کامل

Optimal Software Pipelining of Nested Loops

This paper presents an approach to software pipelining of nested loops. While several papers have addressed software pipelining of single (non-nested) loops, little work has been done in the area of applying it to nested loops. This paper solves the problem of nding the minimum iteration initiation interval (in the absence of resource constraints) for each level of a nested loop. The problem is...

متن کامل

Automatic Hardware Synthesis of Nested Loops Using UET Grids and VHDL

This paper considers the automatic synthesis of systolic architectures from nested loop algorithmic specifications. The high level input is given in the form of uniform dependence loops with unit dependencies and the target architecture is a multidimensional systolic array with unbounded number of cells. A complete methodology for the hardware synthesis of the resulting architecture, based on V...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999